基于遗传算法的弹炮混编防空群火力分配

近期局部战争中的防空作战经验表明:实施弹炮混编可以大大提高防空武器系统的作战效能,而如何实施有效的火力分配又是其中的一个重要环节.针对陆军弹炮混编防空群射击指挥中的火力分配问题,简要分析了防空导弹和高炮武器系统射击的不同特点,提出了弹炮混编防空群的火力分配方法,并建立了优化火力分配方案的数学模型.在此基础上,采用遗传算法对此模型求解.结果表明,遗传算法为弹炮混编防空群的火力优化分配问题提供了一条有效途径.     

Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel

We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is required if a machine switches over from one job to another. Each order is released at time zero and has a positive weight. Preemptions are not allowed. The completion time of an order is the time at which all jobs of that order have been completed. The objective is to minimize the total weighted completion time of the orders. The problem is NP‐hard for any fixed number (≥2) of machines. Because of this, we focus our attention on two classes of heuristics, which we refer to as sequential two‐phase heuristics and dynamic two‐phase heuristics. We perform a worst case analysis as well as an empirical analysis of nine heuristics. Our analyses enable us to rank these heuristics according to their effectiveness, taking solution quality as well as running time into account. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Maximizing project cash availability

Consider a project during the life cycle of which there are cash payouts and in‐flows. To better meet his financial commitments, the project owner would like to meet all deadlines without running out of cash. We show that the cash availability objective is similar to the total weighted flowtime used to measure work‐in‐progress performance in the scheduling and inventory control literatures. In this article we provide several specialized solution methods for the problem of minimizing total weighted flowtime in an arbitrary acyclic project network, subject to activity release times and due dates, where the activity weights may be positive or negative and represent cash in‐ and out‐flows. We describe the structure of an optimal solution and provide several efficient algorithms and their complexity based on mincost and maxflow formulations. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

新型多目标遗传算法及其在导弹射击效能优化中的应用

多目标规划是一类重要的优化模型,有着广泛的实际应用,但其求解至今仍是运筹学的一个难点.针对一般约束多目标优化问题,在设计了新的适应度函数和选择算子的基础上,提出一种新型多目标遗传算法.将其应用于导弹对集群目标射击效能优化问题,验证了算法的有效性.     

UNAMID: an African solution to a complex case of geopolitical dynamics

This article examines the geopolitical dynamics associated with the African Union (AU) and United Nations hybrid operation in Darfur (UNAMID) from the start of the Darfur conflict in 2003 until the time when UNAMID became fully operational in 2011. It provides an overview of the complex forces and geopolitical dynamics that affected the deployment of UNAMID and shaped its unique hybrid character. It mainly highlights those primary geopolitical factors that hindered the full deployment of UNAMID. It is concluded that this period was a showcase for the newly established AU and its support for its member states, as well as a new approach for the international community to maintain international peace and security in alliance with regional organisations.     

一种面向宽带复杂信号侦察的可配置计算应用框架

可配置计算系统的优势与系统设计过程的复杂性是一对矛盾,可配置计算框架为此提供了有益的思路。但受限于适用范围与通用性考虑,已有的特别是商业框架仅支持系统的静态重构。本文针对宽带信号侦察这一特定应用领域,提出了一种功能级可配置计算应用框架BSRRCS-RCAF,该框架将领域应用中具有共性的计算与功能模块抽取和集中起来,形成二进制比特流配置文件库,并提供构建此类系统的公共服务体系。基于公共服务体系以及配置文件库,当需要修改或者重新构建宽带信号侦察系统时,只需在现有框架下动态调用配置组件库,或者遵循框架的统一设计接口完善补充组件库中的特定功能部分,整个系统设计框架将得到方便复用,便于实现基于快速重构的多种系统功能。     

基于联合相似测度的SAR图像边缘点特征配准方法

针对SAR图像配准过程中几何变换影响特征匹配稳健性和适应性的问题,提出了一种在特征匹配过程中直接解算几何变换模型的边缘点特征配准方法。利用SAR图像边缘点的梯度和方向特征,基于像素迁移思想,定义了图像匹配的联合相似度——联合特征均方和(SSJF),并建立了SAR图像边缘点集相似性匹配准则;基于方向模板提出了改进的ROEWA算子;利用改进的遗传算法(GA)来进行相似度的全局优化搜索,获取配准模型参数;利用多幅SAR图像的配准试验,对本文方法的性能进行了验证。     

基于CPU-GPU混合计算平台的RNA二级结构预测算法并行化研究

RNA二级结构预测是生物信息学领域重要的研究方向,基于最小自由能模型的Zuker算法是目前该领域最典型使用最广泛的算法之一。本文基于CPU GPU的混合计算平台实现了对Zuker算法的并行和加速。根据CPU和GPU计算性能的差异,通过合理的任务分配策略,实现二者之间的并行协作计算和处理单元间的负载平衡;针对CPU和GPU的不同硬件特性,对Zuker算法在CPU和GPU上的实现分别采取了不同的并行优化方法,提高了混合加速系统的计算性能。实验结果表明,CPU处理单元在混合系统中承担了14%以上的计算任务,与传统的多核CPU并行方案相比,采用混合并行加速方法可获得15.93的全局加速比;与最优的单纯GPU加速方案相比,可获得16%的性能提升,并且该混合计算方案可用于对其它生物信息学序列分析应用的并行和加速。     

战时装备维修保障资源优化模型

维修资源在抢修过程中的分配决定了抢修活动的平均处理时间和等待时间,针对抢修实施时维修资源的分配,研究资源的优化配置使抢修时间最小的问题.在抢修过程中使抢修时间最小的目标和约束条件下,提出了资源配置优化的排队模型,并结合遗传算法给出了求解最优配置模型的方法,通过实例分析说明了模型和方法的应用情况.资源配置优化模型和算法已成功应用于集群装备保障决策系统的开发.     

数据与知识双驱动的备件需求模糊预测模型

针对知识驱动型需求预测模型所需的专家知识稀缺、数据驱动型需求预测模型可解释性不足的问题,提出了数据与知识双驱动的备件需求模糊预测模型。该模型基于模糊聚类算法将数值型数据聚类为结构简单、可解释性强的规则库,运用模糊逻辑将领域专家知识表示为Mamdani型规则库。在此基础上,引入了一种新型智能计算理论——模糊网络理论对两类规则库进行合并运算,形成初始预测模型。采用遗传算法优化模型规则库的模糊集参数来提高模型预测准确性。通过与模糊聚类算法进行对比,提出的模型在可解释性以及准确性指标上均具有优势。